#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 55;
int a[maxn];
int d[maxn];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n;
		int num1 = 0;
		int num0 = 0;
		scanf("%d",&n);
		for(int i = 0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]%2) num1++;
			else num0++;
		}
		sort(a,a+n);
		int cnt = 0;
		for(int i = 1;i<n;i++)
		{
			if(a[i]-a[i-1]==1)
			{
				d[cnt++] = i;
			}
		}
		if(num0%2==0&&num1%2==0)
		{
			printf("YES\n");
		}
		else 
		{
			if(cnt) printf("YES\n");
			else printf("NO\n");
		}
	}
} 
